What Makes Finite-State Models More (or Less) Testable?
نویسندگان
چکیده
Typically, these kinds of questions are answered with reference to the inherent properties of the assessment mechanism. For example, Lowry et.al. [7] and Menzies & Cukic [8] contrast the costs and defect detection decay rates of formal methods, white box testing, and black box testing. That analysis made assumptions about the completeness of the search and the cost of setting up each run. A drawback with that kind of analysis is it is silent about the model being searched for defects1.
منابع مشابه
Random Search of AND-OR Graphs Representing Finite-State Models
Random Search of AND-OR Graphs Representing Finite-State Models David R. Owen Model checking tools have been effective in testing concurrent software represented by communicating finite-state machines. But these tools may require a very large amount of memory. A finite-state model can be translated automatically into a compact AND-OR graph. We use an abductive random search scheme to extract, f...
متن کاملSynthesis of Fast On-Line Testable Controllers for Data-Domi- nated Applications
A target structure for implementing fast on-line testable control units for data-dominated applications is presented. In many cases, the proposed controller structure leads to a performance improvement of more than 30% for a standard benchmark set whereas the area overhead is less than 15% compared with conventional on-line testable finite state machines (FSM). The proposed approach is compatib...
متن کاملHighly Testable Finite State Machines Based on EXOR Logic
It is well-known that AND/EXOR circuits are more easily testable than AND/OR circuits. Therefore, in this paper, we primarily propose to use AND/EXOR realizations for implementation of the combinational logic parts of finite state machines. Then, we investigate the effect of different state assignments (i.e. one-hot, gray-code, etc.) and that of using different types of registers (i.e. D-type, ...
متن کاملIrredundant sequential machines via optimal logic synthesis
optimal sequential logic synthesis can produce fallv testable nonscan finite state machines. Test generation algorithms can be used It is well known that optimal logic synthesis can ensure fully to remove all the redundancies in sequential machines resulting in testable combinational logic designs. In this paper. we show that fuily testable designs. However. in general. this method requires opt...
متن کاملI-6: Role of Actin Cytoskeleton during Mouse Sperm Acrosomal Exocytosis
Background: Mammalian sperm must undergo a process termed capacitation to become competent to fertilize an egg. Capacitation renders the sperm competent by priming the cells to undergo a rapid exocytotic event called acrosomal exocytosis that is stimulated by the zona pellucida (ZP) of the egg or progesterone. Over the years, several biochemical events have been associated with the capacitation...
متن کامل